Sparse solution of underdetermined linear equations via adaptively iterative thresholding
نویسندگان
چکیده
منابع مشابه
Sparse Solution of Underdetermined Linear Equations via Adaptively Iterative Thresholding
Finding the sparset solution of an underdetermined system of linear equations y = Ax has attracted considerable attention in recent years. Among a large number of algorithms, iterative thresholding algorithms are recognized as one of the most efficient and important classes of algorithms. This is mainly due to their low computational complexities, especially for large scale applications. The ai...
متن کاملSparse nonnegative solution of underdetermined linear equations by linear programming.
Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polyt...
متن کاملNeighborly Polytopes and Sparse Solution of Underdetermined Linear Equations
Consider a d × n matrix A, with d < n. The problem of solving for x in y = Ax is underdetermined, and has many possible solutions (if there are any). In several fields it is of interest to find the sparsest solution – the one with fewest nonzeros – but in general this involves combinatorial optimization. Let ai denote the i-th column of A, 1 ≤ i ≤ n. Associate to A the quotient polytope P forme...
متن کاملSparse CCA via Precision Adjusted Iterative Thresholding
Sparse Canonical Correlation Analysis (CCA) has received considerable attention in high-dimensional data analysis to study the relationship between two sets of random variables. However, there has been remarkably little theoretical statistical foundation on sparse CCA in high-dimensional settings despite active methodological and applied research activities. In this paper, we introduce an eleme...
متن کاملA Non-Negative and Sparse Enough Solution of an Underdetermined Linear System of Equations is Unique
In this paper we consider an underdetermined linear system of equations Ax = b with non-negative entries of A and b, and the solution x being also required to be nonnegative. We show that if there exists a sufficiently sparse solution to this problem, it is necessarily unique. Furthermore, we present a greedy algorithm – a variant of the matching pursuit – that is guaranteed to find this sparse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2014
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2013.10.031